The Genesis of the DCJ Formula
نویسندگان
چکیده
The formula N−(C+I/2) to compute the number of DoubleCut-and-Join operations needed to transform one genome into another is both simple and easy to prove. When it was published, in 2006, we omitted all details on how it was constructed. In this chapter, we will give an elementary treatment on the intuitions and methods underlying the formula, showing that simplicity is sometimes difficult to achieve. We will also prove that this formula is one among an infinite number of candidates, and that the techniques can be applied to other genomic distances.
منابع مشابه
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromosomal genomes, such as inversions, translocations, fusions and fissions. No restriction on the genome structure considering linear and circular chromosomes is imposed. An advantage of this general model is that it lead...
متن کاملAlgorithms for sorting unsigned linear genomes by the DCJ operations
MOTIVATION The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both linear and circular (uni- and multi-) chromosomes is well studied, the only known result for the NP-complete unsigned DCJ distance problem is an approximation algorithm for unsigned linear unichromosomal genomes. In thi...
متن کاملMineralogy, Geochemistry and Raman Spectroscopy of Multi-Genesis Serpentine Polymorphs of Darepahn Ophiolites
The present article pays to some Alpine-Himalayan ophiolites of Late Cretaceous age from Darepahn area in the southern part of Nain-Baft Ophiolite belt. Whole rock processed data clearly shows that the metaperidotite rocks are silica-poor with low CaO, Al2O3, and TiO2 that reflect the predominance of olivine over calcic pyroxene in the protolithes. The considerable content of Co (85.6–124.6 ppm...
متن کاملParking Functions, Labeled Trees and DCJ Sorting Scenarios
In genome rearrangement theory, one of the elusive questions raised in recent years is the enumeration of rearrangement scenarios between two genomes. This problem is related to the uniform generation of rearrangement scenarios, and the derivation of tests of statistical significance of the properties of these scenarios. Here we give an exact formula for the number of double-cut-and-join (DCJ) ...
متن کاملAn Exact Solver for the DCJ Median Problem
The "double-cut-and-join" (DCJ) model of genome rearrangement proposed by Yancopoulos et al. uses the single DCJ operation to account for all genome rearrangement events. Given three signed permutations, the DCJ median problem is to find a fourth permutation that minimizes the sum of the pairwise DCJ distances between it and the three others. In this paper, we present a branch-and-bound method ...
متن کامل